Proximity Frames and Regularization

نویسندگان

  • Guram Bezhanishvili
  • John Harding
چکیده

It is well known that the category KHaus of compact Hausdorff spaces is dually equivalent to the category KRFrm of compact regular frames. By de Vries duality, KHaus is also dually equivalent to the category DeV of de Vries algebras, and so DeV is equivalent to KRFrm, where the latter equivalence can be described constructively through Booleanization. Our purpose here is to lift this circle of equivalences and dual equivalences to the setting of stably compact spaces. The dual equivalence of KHaus and KRFrm has a well-known generalization to a dual equivalence of the categories StKSp of stably compact spaces and StKFrm of stably compact frames. Here we give a common generalization of de Vries algebras and stably compact frames we call proximity frames. For the category PrFrm of proximity frames we introduce the notion of regularization that extends that of Booleanization. This yields the category RPrFrm of regular proximity frames. We show there are equivalences and dual equivalences among PrFrm, its subcategories StKFrm and RPrFrm, and StKSp. Restricting to the compact Hausdorff setting, the equivalences and dual equivalences among StKFrm, RPrFrm, and StKSp yield the known ones among KRFrm, DeV, and KHaus. The restriction of PrFrm to this setting provides a new category StrInc whose objects are frames with strong inclusions and whose morphisms and composition are generalizations of those in DeV. Both KRFrm and DeV are subcategories of StrInc that are equivalent to StrInc. For a compact Hausdorff space X, the category StrInc not only contains both the frame of open sets of X and the de Vries algebra of regular open sets of X, these two objects are isomorphic in StrInc, with the second being the regularization of the first. The restrictions of these categories G. Bezhanishvili (B) · J. Harding Department of Mathematical Sciences, New Mexico State University, Las Cruces, NM 88003, USA e-mail: [email protected] J. Harding e-mail: [email protected] Author's personal copy

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving OSCAR regularization problems by proximal splitting algorithms

The OSCAR (octagonal selection and clustering algorithm for regression) regularizer consists of a `1 norm plus a pair-wise `∞ norm (responsible for its grouping behavior) and was proposed to encourage group sparsity in scenarios where the groups are a priori unknown. The OSCAR regularizer has a nontrivial proximity operator, which limits its applicability. We reformulate this regularizer as a w...

متن کامل

Super-resolution image reconstruction techniques: Trade-offs between the data-fidelity and regularization terms

Stochastic regularized methods are quite advantageous in Super-Resolution (SR) image reconstruction problems. In the particular techniques the SR problem is formulated by means of two terms, the data-fidelity term and the regularization term. The present work examines the effect of each one of these terms on the SR reconstruction result with respect to the presence or absence of noise in the Lo...

متن کامل

Application of Network RTK Positions and Geometric Constraints to the Problem of Attitude Determination Using the GPS Carrier Phase Measurements

Nowadays, navigation is an unavoidable fact in military and civil aerial transportations. The Global Positioning System (GPS) is commonly used for computing the orientation or attitude of a moving platform. The relative positions of the GPS antennas are computed using the GPS code and/or phase measurements. To achieve a precise attitude determination, Carrier phase observations of GPS requiring...

متن کامل

A Fixed-point Proximity Approach to Solving the Support Vector Regression with the Group Lasso Regularization

We introduce an optimization model of the support vector regression with the group lasso regularization and develop a class of efficient two-step fixed-point proximity algorithms to solve it numerically. To overcome the difficulty brought by the non-differentiability of the group lasso regularization term and the loss function in the proposed model, we characterize its solutions as fixed-points...

متن کامل

Multiframe Motion Coupling via Infimal Convolution Regularization for Video Super Resolution

The idea of video super resolution is to use the temporal information of seeing a scene from many slightly different viewpoints in the successive frames of a video to enhance the overall resolution and quality of each frame. Classical energy minimization approaches first establish a correspondence of the current video frame to several of its neighbors and then use this temporal information to e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Applied Categorical Structures

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2014